Projection Pursuit by Polynomial-based Indices
نویسندگان
چکیده
منابع مشابه
Endmember Generation by Projection Pursuit
Projection pursuit (PP) is an interesting concept, which has been found in many applications. It uses a so-called projection index (PI) as a criterion to seek directions that may lead to interesting findings for data analysts. Unlike the principal components analysis (PCA), which uses variance as a measure to find directions that maximizes data variances, the PI used by the PP finds interesting...
متن کاملM-polynomial and degree-based topological indices
Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...
متن کاملRobust Principal Component Analysis by Projection Pursuit
Different algorithms for principal component analysis (PCA) based on the idea of projection pursuit are proposed. We show how the algorithms are constructed, and compare the new algorithms with standard algorithms. With the R implementation pcaPP we demonstrate the usefulness at real data examples. Finally, it will be outlined how the algorithms can be used for robustifying other multivariate m...
متن کاملFunctional Projection Pursuit
This article describes the adaption of exploratory projection pursuit for use with functional data. The aim is to nd \interesting" projections of functional data: e.g. to separate curves into meaningful clusters. Functional data are projected onto low-dimensional subspaces determined by a projection function using a suitable inner product. Such a projection is rapidly computed by representing d...
متن کاملOblique Projection Matching Pursuit
Recent theory of compressed sensing (CS) tells us that sparse signals can be reconstructed from a small number of random samples. In reconstruction of sparse signals, greedy algorithms, such as the orthogonal matching pursuit (OMP), have been shown to be computationally efficient. In this paper, the performance of OMP is shown to be dependent on how well information of the underlying signals is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japanese journal of applied statistics
سال: 1989
ISSN: 0285-0370,1883-8081
DOI: 10.5023/jappstat.18.103